Generic local computation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generic local computation

Many problems of artificial intelligence, or more generally, many problems of information processing, have a generic solution based on local computation on join trees or acyclic hypertrees. There are several variants of this method all based on the algebraic structure of valuation algebras. A strong requirement underlying this approach is that the elements of a problem decomposition form a join...

متن کامل

A Generic Framework for Local Computation

The distributive law known from arithmetics is one of the best tools for a computer scientist to grapple with the intractable nature of many applications. So, efficient algorithms have been developed for the computation of Fourier and Hadamard transforms, Bayesian networks, database queries, decoding problems and many more. The fact that they all benefit from the same technique suggests that a ...

متن کامل

A generic Architecture for local Computation

Valuation algebras are known to present a common roof over various applications out of different domains of research. In combination with the power of local computation it offers a possibility to solve inference problems in an efficient way. Implementing concretely these concepts by instantiating a valuation algebra means loosing the high level of abstraction. This paper presents a generic real...

متن کامل

Implementation of a generic Architecture for Local Computation

Valuation algebras are the foundation of a widespread theory unifying different fields of modern research and culminating in the power of local computation. Although this theory rejoys in great interest from a pure theoretical perspective, many questions were originally motivated by practical experiences. The aim of this paper is to return to this practical starting point by illustrating how th...

متن کامل

Fine Hierarchies of Generic Computation

Suppose that you are a user of a commercial relational database , accessible over the Internet, whose owner has decided to copy the price lists of the US telephone companies | rst order queries are for free just like local calls, because they are local by the theorem of Gaifman 6]. All recursive queries, being potentially non-local, are charged, for simplicity let us assume $1.00 for a Boolean ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 2012

ISSN: 0022-0000

DOI: 10.1016/j.jcss.2011.05.012